package com.LC._62;

class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for(int i=0;i<m;i++) dp[i][0]=1;
        for(int i=0;i<n;i++) dp[0][i]=1;
        for(int i=1;i<m;i++){
            for(int j=1;j<n;j++){
                dp[i][j] =dp[i-1][j] +dp[i][j-1];
                System.out.println(dp[i][j]+"-----");
            }
        }
        return dp[m-1][n-1];
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        int m=3 ,n=7;
        System.out.println(solution.uniquePaths(m ,n));
    }
}